2-Factor hamiltonian graphs
نویسندگان
چکیده
The Heawood graph and K3;3 have the property that all of their 2-factors are Hamilton circuits. We call such graphs 2-factor hamiltonian. We prove that if G is a k-regular bipartite 2factor hamiltonian graph then either G is a circuit or k 1⁄4 3: Furthermore, we construct an infinite family of cubic bipartite 2-factor hamiltonian graphs based on the Heawood graph and K3;3 and conjecture that these are the only such graphs. r 2002 Elsevier Science (USA). All rights reserved.
منابع مشابه
Geometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملOn the Extremal Number of Edges in 2-Factor Hamiltonian Graphs
In this paper we consider the question of determining the maximum number of edges in a hamiltonian graph of order n that contains no 2-factor with more than one cycle, that is, 2-factor hamiltonian graphs. We obtain exact results for both bipartite graphs, and general graphs, and construct extremal graphs in each case. Mathematics Subject Classification (2000). Primary 05C45; Secondary 05C38.
متن کاملOn a family of cubic graphs containing the flower snarks
We consider cubic graphs formed with k ≥ 2 disjoint claws Ci ∼ K1,3 (0 ≤ i ≤ k−1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three vertices of degree 1 of Ci−1 and joined to the three vertices of degree 1 of Ci+1. Denote by ti the vertex of degree 3 of Ci and by T the set {t1, t2, ..., tk−1}. In such a way we construct three distinct graphs, na...
متن کاملOn a simple randomized algorithm for finding a 2-factor in sparse graphs
We analyze the performance of a simple randomized algorithm for finding 2-factors in directed Hamiltonian graphs of out-degree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2-factor in O(n) expected time. The analysis of our algorithm is based on random walks on the line and interestingly resembles the analysis of a random...
متن کاملCycles in 2-Factors of Balanced Bipartite Graphs
In the study of hamiltonian graphs, many well known results use degree conditions to ensure su1⁄2cient edge density for the existence of a hamiltonian cycle. Recently it was shown that the classic degree conditions of Dirac and Ore actually imply far more than the existence of a hamiltonian cycle in a graph G, but also the existence of a 2-factor with exactly k cycles, where 1U k U jV Gj 4 . I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 87 شماره
صفحات -
تاریخ انتشار 2003